Private-Key Cryptosystems Based on Rank Metric
نویسندگان
چکیده
An analogue of McEliece’s cryptosystem, the Gabidulin-Paramonov-Trejtakov (GPT) public-key cryptosystem is based on rank-metric-based Gabidulin codes instead of Goppa codes. The GPT cryptosystem has attracted steady attention since it is much more robust against the decoding attacks and can therefore achieve the same level of security with much smaller keys. The key sizes, nonetheless, may still be too large for some applications. To reduce the key sizes even further, we propose private-key adaptations of the GPT cryptosystem, and evaluate their robustness against several attacks.
منابع مشابه
Résultants de polynômes de Ore et Cryptosystèmes de McEliece sur des Codes Rang faiblement structurés. (Resultants of Ore polynomials and McEliece Cryptosystems based on weakly structured Rank Codes)
Weakly Structured Error Correcting Codes in Rank Metric and their Application to Cryptography The most commonly used encryption techniques in cryptography are based on problems in number theory. Despite their efficiency, they are vulnerable to post-quantum cryptographic attack. Therefore it is relevant to study other types of cryptosystems. In this work we study errorcorrector codes based crypt...
متن کاملEfficient Encryption from Random Quasi-Cyclic Codes
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of low weight. We depart somewhat from Aleknovich’s approach and propose an encryption s...
متن کاملRank based cryptography : a credible post-quantum alternative to classical cryptography
In this paper we present rank-based cryptogra phy and discuss its interest relatively to other post-quantum families of cryptosystems like for in stance code (Hamming)-based cryptography or lattice (Euclidean)-based cryptography. We also survey re cent interesting results for this metric and show that rank based cryptography has many advantages and is a credible alternative to classical cryp...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملPublic Key Cryptosystems with Noisy Secret Keys
Passwords bootstrap symmetric and asymmetric cryptography, tying keys to an individual user. Biometrics are intended to strengthen this tie. Unfortunately, biometrics exhibit noise between repeated readings. Fuzzy extractors (Dodis et al., Eurocrypt 2004) derive stable symmetric keys from noisy sources. We ask if it is also possible for noisy sources to directly replace private keys in asymmetr...
متن کامل